Maximum Neural Network with Nonlinear Self-Feedback and Its Application to Maximum Independent Set Problem
نویسندگان
چکیده
منابع مشابه
Nonpositive Hopfield Neural Network with Self-Feedback and its Application to Maximum Clique Problems
A clique of an undirected graph G (V, E) with a vertex set V and an edge set E is a subset of V such that all pairs of vertices are connected by an edge in E. The maximum clique problem (MCP) is to find a clique of maximum size of the graph G. Figure 1(b) shows a maximum clique of the graph Figure 1(a) with 10 vertices and 21 edges. It is one of the first problems which have been proven to be N...
متن کاملAnnealed chaotic neural network with nonlinear self-feedback and its application to clustering problem
Chaos is a revolutionary concept, which brings a novel strategy of science for researchers. In this paper, a chaotic neural network is proposed and the simulated annealing strategy also embedded to construct an annealed chaotic neural network (ACNN) and apply to the clustering problem. In addition to retain the characteristics of the conventional neural units, the ACNN displays a rich range of ...
متن کامل3D DNA self-assembly for maximum weighted independent set problem
The problem of finding a maximum weighted independent set (MWIS) is a classical combinatorial optimization problem of graph theory, which has been proved to be NP-complete (NPC). A 2-D DNA tile self-assembly model for solving the problem has been proposed previously, but it still has many deficiencies. In this paper, we will propose a 3-D DNA tile self-assembly model based on 2D DNA tile self-a...
متن کاملAn Improved Chaotic Maximum Neural Network for Maximum Clique Problem
We propose an improved chaotic maximum neural network to solve maximum clique problem. Through analyzing the character of maximum neural network with an added vertex in maximum clique problem, we find that the quality and size of clique solution can be modified by tuning a parameter about vertex weight. Based on the analysis, a random nonlinear self-feedback and flexible annealing strategy are ...
متن کاملAn Improved Maximum Neural Network Algorithm for Maximum Cut Problem
In this paper, we propose a new parallel algorithm that can help the maximum neural network escape from local minima for maximum cut problem. By adding a nonlinear self-feedback to the maximum neural network, the proposed parallel algorithm has richer and more flexible dynamics and can prevent the network from getting stuck at local minima. A large number of instances have been simulated to ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2005
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.125.314